منابع مشابه
On upward point set embeddability
Article history: Received 8 September 2011 Accepted 23 November 2012 Available online 27 November 2012 Communicated by D. Wagner
متن کاملUpward Point-Set Embeddability
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of k-switch trees, that is a generalization of switch trees (according to this definition a switch t...
متن کاملUpward Point Set Embeddability for Convex Point Sets Is in P
In this paper, we present a polynomial dynamic programming algorithm that tests whether a n-vertex directed tree T has an upward planar embedding into a convex point-set S of size n. Further, we extend our approach to the class of outerplanar digraphs. This nontrivial and surprising result implies that any given digraph can be efficiently tested for an upward planar embedding into a given conve...
متن کاملOn the Hardness of Point-Set Embeddability⋆
A point-set embedding of a plane graph G with n vertices on a set S of n points is a straight-line drawing of G, where the vertices of G are mapped to distinct points of S. The problem of deciding whether a plane graph admits a point-set embedding on a given set of points is NPcomplete for 2-connected planar graphs, but polynomial-time solvable for outerplanar graphs and plane 3-trees. In this ...
متن کاملPoint-Set Embeddability of 2-Colored Trees
In this paper we study bichromatic point-set embeddings of 2-colored trees on 2-colored point sets, i.e., point-set embeddings of trees (whose vertices are colored red and blue) on point sets (whose points are colored red and blue) such that each red (blue) vertex is mapped to a red (resp. blue) point. We prove that deciding whether a given 2-colored tree admits a bichromatic point-set embeddin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2012.11.008